A Characterization of Quasi-Decreasingness
نویسندگان
چکیده
In 2010 Schernhammer and Gramlich [10] showed that quasi-decreasingness of a DCTRS R is equivalent to μ-termination of its context-sensitive unraveling UCS(R) on original terms. While the direction that quasi-decreasingness ofR implies μ-termination of UCS(R) on original terms is shown directly; the converse – facilitating the use of context-sensitive termination tools like MU-TERM [1] and VMTL [9] – employs the additional notion of context-sensitive quasi-reductivity of R. In the following, we give a direct proof of the fact that μ-termination of UCS(R) on original terms implies quasi-decreasingness of R. Moreover, we report our experimental findings on DCTRSs from the confluence problems database (Cops),1 extending the experiments of Schernhammer and Gramlich.
منابع مشابه
Termination by Quasi-periodic Interpretations
We present a new method for automatically proving termination of term rewriting and string rewriting. It is based on the wellknown idea of interpretation of terms in natural numbers where every rewrite step causes a decrease. In the dependency pair setting only weak monotonicity is required for these interpretations. For these we use quasiperiodic functions. It turns out that then the decreasin...
متن کاملA CHARACTERIZATION OF BAER-IDEALS
An ideal I of a ring R is called right Baer-ideal if there exists an idempotent e 2 R such that r(I) = eR. We know that R is quasi-Baer if every ideal of R is a right Baer-ideal, R is n-generalized right quasi-Baer if for each I E R the ideal In is right Baer-ideal, and R is right principaly quasi-Baer if every principal right ideal of R is a right Baer-ideal. Therefore the concept of Baer idea...
متن کاملA New and Formalized Proof of Abstract Completion
Completion is one of the most studied techniques in term rewriting. We present a new proof of the correctness of abstract completion that is based on peak decreasingness, a special case of decreasing diagrams. Peak decreasingness replaces Newman’s Lemma and allows us to avoid proof orders in the correctness proof of completion. As a result, our proof is simpler than the one presented in textboo...
متن کاملA Resource Aware Computational Interpretation for Herbelin's Syntax
We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin’s syntax a type system based on non-idempotent intersection types, together with a set of reduction rules –inspired from the substitution at a distance paradigm– that preserves (and decreases the size of) typing ...
متن کاملCHARACTERIZATION OF REGULAR $Gamma$−SEMIGROUPS THROUGH FUZZY IDEALS
Notions of strongly regular, regular and left(right) regular $Gamma$−semigroupsare introduced. Equivalent conditions are obtained through fuzzy notion for a$Gamma$−semigroup to be either strongly regular or regular or left regular.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.03345 شماره
صفحات -
تاریخ انتشار 2016